Minkowski Functionals Study of Random Number Sequences
نویسندگان
چکیده
Random number sequences are used in a wide range of applications such as simulation, sampling, numerical analysis, cryptography, and recreation. The quality of random number sequences is critical to the correctness of these applications. Many statistical tests have been developed to test various characteristics of random number generators such as randomness, independence, uniformity, etc. Most of them are based on testing on a single sequence. When multiple sequences are employed in an application, their potential correlations are also concerned. In this paper, we explore the techniques of using the Minkowski functionals and their extensions, the Minkowski valuations, to study the mathematical morphology of two dimensional binary image generated by pairwise random number sequences, and apply this method to describe and compare the properties of several well-known pseudoand quasi-random number generators.
منابع مشابه
Minkowski Functional Description of Microwave Background Gaussianity
A Gaussian distribution of cosmic microwave background temperature fluctuations is a generic prediction of inflation. Upcoming high-resolution maps of the microwave background will allow detailed tests of Gaussianity down to small angular scales, providing a crucial test of inflation. We propose Minkowski functionals as a calculational tool for testing Gaussianity and characterizing deviations ...
متن کاملOn the Local Connectivity Number of Stationary Random Closed Sets
Random closed sets (RACS) in the d–dimensional Euclidean space are considered, whose realizations belong to the extended convex ring. A family of nonparametric estimators is investigated for the simultaneous estimation of the vector of all specific Minkowski functionals (or, equivalently, the specific intrinsic volumes) of stationary RACS. The construction of these estimators is based on a repr...
متن کاملAlgorithms for the computation of the Minkowski functionals of deterministic and random polyconvex sets
We give algorithms for the simultaneous computation of the area, boundary length and connectivity (the so–called Minkowski functionals) of binary images. It is assumed that a binary image is a discretization of a two–dimensional polyconvex set which is a union of convex components. Edge–corrected versions of these algorithms are used for the estimation of specific intrinsic volumes of a station...
متن کاملEfficient Processing of Minkowski Functionals on a 3D Binary Image Using Binary Decision Diagrams
The Morphological Image Analysis characterizes binary digitized 3D images in terms of shape (geometry) and connectivity (topology) by means of the Minkowski functionals known from integral geometry. In three dimensions, these functionals correspond to the enclosed volume, surface area, mean breadth and connectivity (Euler characteristic). To compute these functionals, it is necessary to count t...
متن کامل